An Adaptive Quasi Monte Carlo Alternative to Metropolis
نویسنده
چکیده
We present a manually-adaptive extension of Quasi Monte Carlo (QMC) integration for approximating marginal densities, moments, and quantiles when the joint density is known up to a normalization constant. Randomization and a batch-wise approach involving (0; s)-sequences are the cornerstones of the technique. By incorporating a variety of graphical diagnostics the method allows the user to adap-tively allocate points for joint density function evaluations. Through intelligent allocation of resources to diierent regions of the marginal space, the method can quickly produce reliable marginal density approximations in moderate dimensions. We demonstrate by examples that adaptive QMC can be a viable alternative to the Metropolis algorithm.
منابع مشابه
On the e ciency of adaptive MCMC algorithms
Abstract We study a class of adaptive Markov Chain Monte Carlo (MCMC) processes which aim at behaving as an optimal target process via a learning procedure. We show, under appropriate conditions, that the adaptive process and the optimal (nonadaptive) MCMC process share identical asymptotic properties. The special case of adaptive MCMC algorithms governed by stochastic approximation is consider...
متن کاملExploring quasi Monte Carlo for marginal density approximation
We ®rst review quasi Monte Carlo (QMC) integration for approximating integrals, which we believe is a useful tool often overlooked by statistics researchers. We then present a manuallyadaptive extension of QMC for approximating marginal densities when the joint density is known up to a normalization constant. Randomization and a batch-wise approach involving 0; s-sequences are the cornerstone...
متن کاملDiscrepancy estimates for variance bounding Markov chain quasi-Monte Carlo
Markov chain Monte Carlo (MCMC) simulations are modeled as driven by true random numbers. We consider variance bounding Markov chains driven by a deterministic sequence of numbers. The star-discrepancy provides a measure of efficiency of such Markov chain quasi-Monte Carlo methods. We define a pull-back discrepancy of the driver sequence and state a close relation to the star-discrepancy of the...
متن کاملDEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS Bayesian Analysis of the Stochastic Conditional Duration Model
A Bayesian Markov Chain Monte Carlo methodology is developed for estimating the stochastic conditional duration model. The conditional mean of durations between trades is modelled as a latent stochastic process, with the conditional distribution of durations having positive support. The sampling scheme employed is a hybrid of the Gibbs and Metropolis Hastings algorithms, with the latent vector ...
متن کاملMarkov Chain Monte Carlo methods: Implementation and comparison
The paper and presentation will focus on MCMC methods, implemented together in MC2Pack, an ox package which allows you to run a range of sampling algorithm (MH, Gibbs, Griddy Gibbs, Adaptive Polar Importance Sampling, Adaptive Polar Sampling, and Adaptive Rejection Metropolis Sampling) on a given posterior. Computation of the marginal likelihood for the model is also done automatically, allowin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996